翻訳と辞書 Words near each other ・ Higinio Uriarte ・ Higinio Vélez ・ Higino A. Acala, Sr. ・ Higiri Station ・ Higl ・ Higlet ・ Higlett ・ Higley ・ Higley Flow State Park ・ Higley High School ・ Higley Unified School District ・ Higley, Arizona ・ Higman ・ Higman group ・ Higman's embedding theorem ・ Higman's lemma ・ Higman's theorem ・ Higman–Sims graph ・ Higman–Sims group ・ Hignell ・ Hignett ・ Higo Ko-ryu ・ Higo Province ・ Higo Seara Santos de Oliveira ・ Higo-Ikura Station ・ Higo-Nagahama Station ・ Higo-Ōzu Station ・ Higobashi Station ・ Higonokami ・ Higonoumi Naoya Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Higman's lemma ： ウィキペディア英語版 Higman's lemma In mathematics, Higman's lemma states that the set of finite sequences over a finite alphabet, as partially ordered by the subsequence relation, is well-quasi-ordered. That is, if $w\_1,\; w\_2,\; \backslash ldots$ is an infinite sequence of words over some fixed finite alphabet, then there exist indices such that $w\_i$ can be obtained from $w\_j$ by deleting some (possibly none) symbols. More generally this remains true when the alphabet is not necessarily finite, but is itself well-quasi-ordered, and the subsequence relation allows the replacement of symbols by earlier symbols in the well-quasi-ordering of labels. This is a special case of the later Kruskal's tree theorem. It is named after Graham Higman, who published it in 1952. ==References== * 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Higman's lemma」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.